Evaluating Centrality Metrics in Real-World Networks on GPU Anuroop Sriram Kollu Gautham Kishore Kothapalli P. J. Narayan R Govindarajulu International Institute of Information Technology, Hyderabad Gachibowli, Hyderabad

Source URL: www.hipc.org

• Theoretical computer science
• Networks
• Network analysis
• Search algorithms
• Centrality
• Betweenness centrality
• Shortest path problem
• Breadth-first search
• Parallel computing
• Mathematics
• Graph theory
• Network theory

Multipath Wireless Network Coding: An Augmented Potential Game Perspective Vinod Ramaswamy∗ , Vinith Reddy∗ , Srinivas Shakkottai∗ , Alex Sprintson∗ and Natarajan Gautam† ∗ Dept. of ECE, Texas A&M University

Source URL: www.ece.tamu.edu

• Network flow
• Coding theory
• Network coding
• Network performance
• Wireless sensor network
• Flow network
• Route assignment
• Static single assignment form
• Shortest path problem
• Graph theory
• Mathematics
• Theoretical computer science

Robust Execution of Contingent, Temporally Flexible Plans

Source URL: www.aaai.org

• Search algorithms
• Tree traversal
• Bellman–Ford algorithm
• Distributed computing
• Depth-first search
• Tree
• Connectivity
• Bridge
• Shortest path problem
• Mathematics
• Graph theory
• Theoretical computer science

arXiv:cond-mat/0309045v1 [cond-mat.stat-mech] 1 Sep[removed]A measure of betweenness centrality based on random walks M. E. J. Newman Department of Physics and Center for the Study of Complex Systems,

Source URL: arxiv.org

• Theoretical computer science
• Networks
• Network analysis
• Algebraic graph theory
• Centrality
• Betweenness centrality
• Distance
• Girvan–Newman algorithm
• Shortest path problem
• Graph theory
• Mathematics
• Network theory

CHAPTER 3 Chinese postman problem Learning objectives

Source URL: ie454.cankaya.edu.tr

• Eulerian path
• Graph
• Handshaking lemma
• Tree
• Vertex
• Cycle graph
• Line graph
• Graph theory
• Mathematics
• Route inspection problem

April 16, [removed]Spring 2008 Quiz 2 Introduction to Algorithms Massachusetts Institute of Technology

Source URL: courses.csail.mit.edu

• Network theory
• Routing algorithms
• Search algorithms
• Spanning tree
• Shortest path problem
• Breadth-first search
• Bellman–Ford algorithm
• Graph
• Distance
• Graph theory
• Mathematics
• Theoretical computer science

An E cient Mean Field Annealing Formulation for Mapping Unstructured? Domains to Hypercubes Cevdet Aykanat and I_smail Haritao
glu Computer Engineering Department, Bilkent University, Ankara, Turkey [removed]

Source URL: www.cs.bilkent.edu.tr

• NP-complete problems
• Cubes
• Hypercube
• Parallel computing
• Shortest path problem
• Heuristic
• Graph partition
• Algorithm
• Mathematics
• Theoretical computer science
• Computational complexity theory

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 9, no. 1, pp. 165–[removed]Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes C. Erten

Source URL: jgaa.info

• Force-based algorithms
• Graph
• Topology
• Shortest path problem
• Power graph analysis
• Path decomposition
• Graph theory
• Mathematics
• Graph drawing

1995 Paper 1 Question 7 Discrete Mathematics Define a bipartite graph, a matching in a bipartite graph, and an augmenting path relative to a matching. Show that all matchings other than the largest have an augmenting pa

Source URL: www.cl.cam.ac.uk

c Applied Mathematics E-Notes, [removed]), [removed] Available free at mirror sites of http://www.math.nthu.edu.tw/∼amen/ ISSN[removed]

Source URL: www.math.nthu.edu.tw

• Connectivity
• Graph operations
• Path decomposition
• Line graph
• Graph theory
• Tree
• Extremal graph theory